Robust PCA Synthetic Control

نویسندگان

چکیده

In this study, I propose a five-step algorithm for synthetic control method comparative studies. My builds on the model of Abadie et al., 2015 and later Amjad 2018. apply all three methods (robust PCA control, robust control) to answer hypothetical question, what would have been per capita GDP West Germany if it had not reunified with East in 1990? then algorithms two placebo Finally, check robustness. This paper demonstrates that my can outperform 2018 studies is less sensitive weights members than 2015.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random Consensus Robust PCA

In this section we give the proof of Theorem 1. Recall that Ω is a d×(d−r) matrix, and that ωi ⊂ {1, . . . , d} indexes the r + 1 nonzero entries in the i column of Ω. Each ωi indicates the coordinates of a projection of U that we aim to identify. Since r2pca selects a matrix Ω satisfying (i), Lemma 1 implies that if we find the projections of U onto the coordinates indicated in Ω, then we can ...

متن کامل

Fast-Robust PCA

Principal Component Analysis (PCA) is a powerful and widely used tool in Computer Vision and is applied, e.g., for dimensionality reduction. But as a drawback, it is not robust to outliers. Hence, if the input data is corrupted, an arbitrarily wrong representation is obtained. To overcome this problem, various methods have been proposed to robustly estimate the PCA coefficients, but these metho...

متن کامل

Non-convex Robust PCA

We propose a new method for robust PCA – the task of recovering a low-rank matrix from sparse corruptions that are of unknown value and support. Our method involves alternating between projecting appropriate residuals onto the set of low-rank matrices, and the set of sparse matrices; each projection is non-convex but easy to compute. In spite of this non-convexity, we establish exact recovery o...

متن کامل

Robust PCA and Robust Subspace Tracking

Principal Components Analysis (PCA) is one of the most widely used dimension reduction techniques. Given a matrix of clean data, PCA is easily accomplished via singular value decomposition (SVD) on the data matrix. While PCA for relatively clean data is an easy and solved problem, it becomes much harder if the data is corrupted by even a few outliers. The reason is that SVD is sensitive to outl...

متن کامل

Robust PCA with compressed data

The robust principal component analysis (RPCA) problem seeks to separate lowrank trends from sparse outliers within a data matrix, that is, to approximate a n⇥d matrix D as the sum of a low-rank matrix L and a sparse matrix S. We examine the robust principal component analysis (RPCA) problem under data compression, where the data Y is approximately given by (L+S)·C, that is, a low-rank + sparse...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Social Science Research Network

سال: 2021

ISSN: ['1556-5068']

DOI: https://doi.org/10.2139/ssrn.3920293